闘本 4.8 最初の共通祖先

提出

code: txt

def common_ancector(node1, node2):

visited_node1 = set()

visited_node2 = set()

while len(visited_node1.intersection(visited_node2)) == 0

visited_node1.add(node1.parent)